Theorem Proving Techniques for View Deletion in Databases
نویسندگان
چکیده
منابع مشابه
Theorem Proving Techniques for View Deletion in Databases
In this paper, we show how techniques from first-order theorem proving can be used for efficient deductive database updates. The key idea is to transform the given database, together with the update request, into a (disjunctive) logic program and to apply the hyper-tableau calculus (Baumgartner et al., 1996) to solve the original update problem. The resulting algorithm has the following propert...
متن کاملTheorem Proving Support for View Consistency Checking
A formal, mechanically checked specification of the consistency constraints between two views of object-oriented systems are presented. The views, described in the BON modelling language, capture the static architecture of systems via contract-annotated class diagrams, and the dynamic view provided by collaboration diagrams. The constraints are specified as an extension of the BON metamodel, an...
متن کاملLemmaManagement Techniques for Automated Theorem Proving
Lemmas can provide valuable help for constructing a proof, by providing intermediate steps. However, not all the formulae supplied to an ATP system as lemmas are necessarily helpful. It is therefore necessary to develop lemma management techniques that use the right lemmas at the right time, to improve the problem-solving ability of ATP systems. This paper presents three lemma management techni...
متن کاملIn Advanced Forml Theorem - Proving Techniques
Stanford Research Inst itute is now engaged in a continuing project to invest igate and develop techniques in art ificial intelligence and to apply t hem to the cont rol of a mobile automaton. Major topics being studied under that project include problem solving, visual pattern recog-nit ion , computer represent at ions, quest ion answering, and system integra-t ion The problem-solving research...
متن کاملChaining Techniques for Automated Theorem Proving in Many-Valued Logics
We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we show that superposition specializes to a refined version of the manyvalued resolution rules introduced by Baaz and Fermüller, and that ordered chaining can be specialized to a refutationally complete inference system for regular clauses.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2000
ISSN: 0747-7171
DOI: 10.1006/jsco.1999.0358